A Second-Order Perceptron Algorithm
نویسندگان
چکیده
منابع مشابه
A Second-Order Perceptron Algorithm
Kernel-based linear-threshold algorithms, such as support vector machines and Perceptron-like algorithms, are among the best available techniques for solving pattern classification problems. In this paper, we describe an extension of the classical Perceptron algorithm, called second-order Perceptron, and analyze its performance within the mistake bound model of on-line learning. The bound achie...
متن کاملEnhanced Second Order Algorithm
Second order algorithms belong to the class of repetitive heuristic techniques, where a greedy heuristic is applied to different subsets of the space of feasible solutions of a problem. The algorithm establishes a sequence of self-contained solutions subspaces, defining an iterative process that guides a subordinate greedy heuristic through those subspaces. This steepest descent process establi...
متن کاملA Smooth Perceptron Algorithm
The perceptron algorithm, introduced in the late fifties in the machine learning community, is a simple greedy algorithm for finding a solution to a finite set of linear inequalities. The algorithm’s main advantages are its simplicity and noise tolerance. The algorithm’s main disadvantage is its slow convergence rate. We propose a modified version of the perceptron algorithm that retains the al...
متن کاملA second-order iterated smoothing algorithm
Simulation-based inference for partially observed stochastic dynamic models is currently receiving much attention due to the fact that direct computation of the likelihood is not possible in many practical situations. Iterated filtering methodologies enable maximization of the likelihood function using simulation-based sequential Monte Carlo filters. Doucet et al. (2013) developed an approximat...
متن کاملA New Second-order Strapdown Attitude Algorithm
Typically coning motion has been used as a standard input to assess the performance of the strapdown attitude algorithms. Traditional coning algorithms are based on the Bortz’s first-order rotation vector equation. The algorithm error is composed of two parts: drift error and approximation error. For the three (or more)-sample coning algorithms, calculation indicates that approximation error is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2005
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539703432542